On strong 1-factors and Hamilton weights of cubic graphs
نویسنده
چکیده
A 1-factor M of a cubic graph G is strong if |M ∩ T |= 1 for each 3-edge-cut T of G. It is proved in this paper that a cubic graph G has precisely three strong 1-factors if and only if the graph can be obtained from K4 via a series of 4 ↔ Y operations. Consequently, the graph G admits a Hamilton weight and is uniquely edge-3-colorable. c © 2001 Elsevier Science B.V. All rights reserved.
منابع مشابه
The robust vertex centdian location problem with interval vertex weights on general graphs
In this paper, the robust vertex centdian location problem with uncertain vertex weights on general graphs is studied. The used criterion to solve the problem is the min-max regret criterion. This problem is investigated with objective function contains $lambda$ and a polynomial time algorithm for the problem is presented. It is shown that the vertex centdian problem on general graphs i...
متن کاملOn Hamilton cycles in cubic (m, n)-metacirculant graphs, II
continue to investigate the problem of the existence of a Hamilton connected cubic (m,n)-metacirculant graphs. We show that a connected cubic (m,n)-metacirculant graph G = MC(m, n, a, So, ,.., has Hamilton cycle if either a 2 == 1 (mod n) or in the case of an odd number f.L one of the numbers (a 1) or a + a 2 _ ... ajJ.-2 + ajJ.-l) relatively to n. As a corollary of results we obtain that every...
متن کاملHeuristic search for Hamilton cycles in cubic graphs
A successful heuristic algorithm for nding Hamilton cycles in cubic graphs is described Several graphs from The Foster census of connected symmetric trivalent graphs and all cubic Cayley graphs of the group PSL are shown to be hamiltonian Proposed running head HAMILTON CYCLES IN CUBIC GRAPHS
متن کاملCubic symmetric graphs of orders $36p$ and $36p^{2}$
A graph is textit{symmetric}, if its automorphism group is transitive on the set of its arcs. In this paper, we classifyall the connected cubic symmetric graphs of order $36p$ and $36p^{2}$, for each prime $p$, of which the proof depends on the classification of finite simple groups.
متن کاملHamilton-Laceability of Honeycomb Toriodal graphs
In this paper, we build on the work of Alspach, Chen, and Dean [2] who showed that proving the hamiltonicity of the Cayley graph of the the dihedral group Dn reduces to showing that certain cubic, connected, bipartite graphs (called honeycomb toroidal graphs) are hamilton laceable; that is, any two vertices at odd distance from each other can be joined by a hamilton path. Alspach, Chen, and Dea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 230 شماره
صفحات -
تاریخ انتشار 2001